Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Indoor robot localization and 3D dense mapping based on ORB-SLAM
HOU Rongbo, WEI Wu, HUANG Ting, DENG Chaofeng
Journal of Computer Applications    2017, 37 (5): 1439-1444.   DOI: 10.11772/j.issn.1001-9081.2017.05.1439
Abstract1776)      PDF (994KB)(947)       Save
In the indoor robot localization and 3D dense mapping, the existing methods can not satisfy the requirements of high-precision localization, large-scale and rapid mapping. The ORB-SLAM (Oriented FAST and Rotated BRIEF-Simultaneous Localization And Mapping) algorithm, which has three parallel threads including tracking, map building and relocation, was used to estimate the three-dimensional (3D) pose of the robot. And then 3D dense point cloud was obtained by using the depth camera KINECT. The key frame extraction method in spatial domain was introduced to eliminate redundant frames, and the sub-map method was proposed to reduce the cost of mapping, thereby the whole speed of the algorithm was improved. The experiment results show that the proposed method can locate the robot position accurately in a large range. In the range of 50 meters, the root-mean-square error of the robot is 1.04 m, namely the error is 2%, the overall speed is 11 frame/s, and the localization speed is up to 17 frame/s. The proposed method can meet the requirements of indoor robot localization and 3D dense mapping with high precision, large-scale and rapidity.
Reference | Related Articles | Metrics
IP address lookup algorithm based on multi-bit priority tries tree
HUANG Sheng ZHANG Wei WU Chuanchuan CHEN Shenglan
Journal of Computer Applications    2014, 34 (3): 615-618.   DOI: 10.11772/j.issn.1001-9081.2014.03.0615
Abstract564)      PDF (671KB)(522)       Save

Concerning the low efficiency of present methods of IP lookup, a new data lookup algorithm based on Multi-Bit Priority Tries (MBPT) was proposed in this paper. By storing the prefixes with higher priority in dummy nodes of multi-bit tries in proper order and storing the prefixes for being extended in an auxiliary storage structure,this algorithm tried to make the structure find the longest matching prefix in the internal node instead of the leaf node. Meanwhile, the algorithm avoided the reconstruction of router-table when it needed to be updated. The simulation results show that the proposed algorithm can effectively minimize the number of memory accesses for dynamic router-table operations, including lookup, insertion and deletion, which significantly improves the speed of router-table lookup as well as update.

Related Articles | Metrics
Underwater targets extraction method based on Blob analysis and Bayesian design-making
SHI Xiao-cheng HAO Li-chao ZHANG Wei WU Di
Journal of Computer Applications    2012, 32 (11): 3214-3217.   DOI: 10.3724/SP.J.1087.2012.03214
Abstract839)      PDF (618KB)(431)       Save
As it is known that the underwater environment is quite complicated and changeable, as a result, targets and pseudo targets always have a high degree of mixing, and one single segmentation method usually could not abstract ideal target regions. Therefore, this paper proposed a new segmentation method based on Blob analysis and Bayesian design-making. Firstly, the optimistic thresholds were calculated by the improved OTSU algorithm, and then the image was segmented according to this threshold. Through analyzing the connectivity characters, closed contours of regions were achieved. Secondly, the connected regions were described using 7 dimensions of Blob operators and pseudo-target regions were eliminated based on Bayesian decision-making rules. Finally, burrs and disturbances were wiped off through the usage of mathematical morphology operators and ideal target regions were achieved. Through dealing with the images grabbed during the pool experiments using the above method, accuracy and efficiency of the method were verified and the real target regions were acquired.
Reference | Related Articles | Metrics
Blue-green algae bloom forecast platform with Internet of things
YANG Hong-wei WU Ting-feng ZHANG Wei-yi LI Wei
Journal of Computer Applications    2011, 31 (10): 2841-2843.   DOI: 10.3724/SP.J.1087.2011.02841
Abstract1904)      PDF (693KB)(651)       Save
To overcome the shortcomings of conventional algal bloom forecast system in acquiring data, this study applied the Internet of Things (IoT) technology to establish a data transmission network with three-layer structure, and thus secured data continuity. With improved retrieval approach of water quality parameters, technology of Wireless Sensor Network (WSN) and forecast model of algal bloom, the blue-green algal bloom forecast platform was developed. The evaluation demonstrates that the platform achieves an overall accuracy of 80% in forecasting blue-green blooms in Taihu Lake in next three days.
Related Articles | Metrics